The finite embeddability property for IP loops and local embeddability of groups into finite IP loops
نویسندگان
چکیده
منابع مشابه
Finite embeddability property for residuated groupoids
A very simple proof of the finite embeddability property for residuated distributivelattice-ordered groupoids and some related classes of algebras is presented. In particular, this gives an answer to the question posed in [3, Problem 4.2]. The presented construction allows for improvement of the upper bound on the complexity of the decision procedure for the universal theory of residuated distr...
متن کاملSemisimplicity, Amalgamation Property and Finite Embeddability Property of Residuated Lattices
In this thesis, we study semisimplicity, amalgamation property and finite embeddability property of residuated lattices. We prove semisimplicity and amalgamation property of residuated lattices which are of purely algebraic character, by using proof-theoretic methods and results of substructural logics. On the other hand, we show the finite model property (FMP) for various substructural logics,...
متن کاملOn the Finite Embeddability Property for Residuated Ordered Groupoids
The finite embeddability property (FEP) for integral, commutative residuated ordered monoids was established by W. J. Blok and C. J. van Alten in 2002. Using Higman’s finite basis theorem for divisibility orders we prove that the assumptions of commutativity and associativity are not required: the classes of integral residuated ordered monoids and integral residuated ordered groupoids have the ...
متن کاملUltrafilters maximal for finite embeddability
In this paper we study a notion of preorder that arises in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and its generalization to ultrafilters, which is related to the algebraical and topological structure of the Stone-Čech compactification of the discrete space of natural numbers. In particular, we prove that there exist ultrafilters maximal for...
متن کاملOn the Finite Embeddability Property for Residuated Lattices, Pocrims and BCK-algebras
To see that a finitely axiomatizable logic is decidable—in the sense that it has a decidable set of theorems—it suffices to show that it has the finite model property, and indeed, this has been the method of choice for establishing decidability of propositional logics. A logic is said to have the finite model property (FMP) if every formula that fails to be a theorem of the logic can be refuted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2019
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1884.5cb